Plunge milling time optimization via mixed-integer nonlinear programming
نویسندگان
چکیده
Plunge milling is a recent and efficient production mean for machining deep workpieces, notably in aeronautics. This paper focuses on the minimization of the machining time by optimizing the values of the cutting parameters. Currently, neither Computer-Aided Manufacturing (CAM) software nor standard approaches take into account the tool path geometry and the control laws driving the tool displacements to propose optimal cutting parameter values, despite their significant impact. This paper contributes to plunge milling optimization through a Mixed-Integer NonLinear Programming (MINLP) approach, which enables us to determine optimal cutting parameter values that evolve along the tool path. It involves both continuous (cutting speed, feed per tooth) and, in contrast with standard approaches, integer (number of plunges) optimization variables, as well as nonlinear constraints. These constraints are related to the Computer Numerical Control (CNC) machine tool and to the cutting tool, taking into account the control laws. Computational results, validated on CNC machines and on representative test cases of engine housing, show that our methodology outperforms standard industrial engineering know-how approaches by up to 55% in terms of machining time.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملA mixed integer nonlinear programming model for optimizing a gas pipeline transmission linear network
The technical equipment developed and used in both installation and operation processes in refineries, oil and gas pipelines, and gas booster stations has always been expensive. Hence, managers at different organizational levels are keen to find methods to control and reduce these costs. Generally speaking, the operators in a gas booster station choose the operating devices without considering ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملMulti-choice mixed integer goal programming optimization for real problems in a sugar and ethanol milling company
Article history: Received 2 August 2011 Received in revised form 19 November 2012 Accepted 21 December 2012 Available online 10 January 2013
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Industrial Engineering
دوره 98 شماره
صفحات -
تاریخ انتشار 2016